By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Matrix Analysis and Applications

Table of Contents
Search This Issue
Volume 3, Issue 4, pp. 411-605

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Rearrangeable Networks with Limited Depth

Nicholas Pippenger and Andrew C.-C. Yao

pp. 411-417

BibTeX  Abstract Full Text:  PDF

Gossiping without Duplicate Transmissions

Douglas B. West

pp. 418-419

BibTeX  Abstract Full Text:  PDF

On the Computation of the Competition Number of a Graph

Robert J. Opsut

pp. 420-428

BibTeX  Abstract Full Text:  PDF

Algorithms for Testing the Diagonal Similarity of Matrices and Related Problems

Gernot M. Engel and Hans Schneider

pp. 429-438

BibTeX  Abstract Full Text:  PDF

New Methods for Evaluating Distrebuation Automation and Control (DAC) Sysyem Benefits

John Peschon and Dale Ross

pp. 439-452

BibTeX  Abstract Full Text:  PDF

Practical Applicatons of Discrete Mathmatical Programming in Exxon

William P. Drews

pp. 453-464

BibTeX  Abstract Full Text:  PDF

Sorting and Merging in Rounds

R. Häggkvist and P. Hell

pp. 465-473

BibTeX  Abstract Full Text:  PDF

The Bounded Path Tree Problem

Paolo M. Camerini and Giulia Galbiati

pp. 474-484

BibTeX  Abstract Full Text:  PDF

The Interval Count of a Graph

R. Leibowitz, S. F. Assmann, and G. W. Peck

pp. 485-494

BibTeX  Abstract Full Text:  PDF

Majorization of Finite Partially Ordered Sets

Ko-Wei Lih

pp. 495-503

BibTeX  Abstract Full Text:  PDF

A Primal Approach to the Simple Plant Location Problem

Gerard Cornuejols and Jean-Michel Thizy

pp. 504-510

BibTeX  Abstract Full Text:  PDF

Vertices Belonging to All or to No Maximum Stable Sets of a Graph

P. L. Hammer, P. Hansen, and B. Simeone

pp. 511-522

BibTeX  Abstract Full Text:  PDF

Minimizing a Combinatorial Function

Ding Zhu Du and F. K. Hwang

pp. 523-528

BibTeX  Abstract Full Text:  PDF

Fixed Point Behavior of Threshold Functions on a Finite Set

Eric Goles

pp. 529-531

BibTeX  Abstract Full Text:  PDF

Speed-Up in Dynamic Programming

F. Frances Yao

pp. 532-540

BibTeX  Abstract Full Text:  PDF

An Algorithm for Partitioning the Nodes of a Graph

Earl R. Barnes

pp. 541-550

BibTeX  Abstract Full Text:  PDF

Finite Solution Theory for Coalitional Games

William F. Lucas and Kai Michaelis

pp. 551-565

BibTeX  Abstract Full Text:  PDF

Double Semiorders and Double Indifference Graphs

Margaret B. Cozzens and Fred S. Roberts

pp. 566-583

BibTeX  Abstract Full Text:  PDF

On the Greedy Heuristic for Continuous Covering and Packing Problems

Marshall L. Fisher and Laurence A. Wolsey

pp. 584-591

BibTeX  Abstract Full Text:  PDF

Recursive Algorithms for Unitary and Symplectic Group Representations

Kenneth Baclawski

pp. 592-605

BibTeX  Abstract Full Text:  PDF